An Incremental Algorithm for Computing Cylindrical Algebraic Decompositions

In this paper, we propose an incremental algorithm for computing cylindrical algebraic decompositions. The algorithm consists of two parts: computing a complex cylindrical tree and refining this complex tree into a cylindrical tree in real space. The incrementality comes from the first part of the algorithm, where a complex cylindrical tree is constructed by refining a previous complex cylindrical tree with a polynomial constraint. We have implemented our algorithm in Maple. The experimentation shows that the proposed algorithm outperforms existing ones for many examples taken from the literature

An Algorithm for Computing the Limit Points of the Quasi-component of a Regular Chain

For a regular chain $R$, we propose an algorithm which computes the (non-trivial) limit points of the quasi-component of $R$, that is, the set $\bar{W(R)} \setminus W(R)$. Our procedure relies on Puiseux series expansions and does not require to compute a system of generators of the saturated ideal of $R$. We focus on the case where this saturated ideal has dimension one and we discuss extensions of this work in higher dimensions. We provide experimental results illustrating the benefits of our algorithms

Parallel Integer Polynomial Multiplication

We propose a new algorithm for multiplying dense polynomials with integer coefficients in a parallel fashion, targeting multi-core processor architectures. Complexity estimates and experimental comparisons demonstrate the advantages of this new approach

Real Root Isolation of Regular Chains

We present an algorithm RealRootIsolate for isolating the real roots of a system of multivariate polynomials given by a zerodimensional squarefree regular chain. The output of the algorithm is guaranteed in the sense that all real roots are obtained and are described by boxes of arbitrary precision. Real roots are encoded with a hybrid representation, combining a symbolic object, namely a regular chain, and a numerical approximation given by intervals. Our isolation algorithm is a generalization, for regular chains, of the algorithm proposed by Collins and Akritas. We have implemented RealRootIsolate as a command of the module SemiAlgebraicSetTools of the RegularChains library in Maple. Benchmarks are reported.

Bell’s nonlocality can be detected by the violation of Einstein-Podolsky-Rosen steering inequality

Recently quantum nonlocality has been classified into three distinct types: quantum entanglement, Einstein-Podolsky-Rosen steering, and Bell’s nonlocality. Among which, Bell’s nonlocality is the strongest type. Bell’s nonlocality for quantum states is usually detected by violation of some Bell’s inequalities, such as Clause-Horne-Shimony-Holt inequality for two qubits. Steering is a manifestation of nonlocality intermediate between entanglement and Bell’s nonlocality. This peculiar feature has led to a curious quantum phenomenon, the one-way Einstein-Podolsky-Rosen steering. The one-way steering was an important open question presented in 2007, and positively answered in 2014 by Bowles et al., who presented a simple class of one-way steerable states in a two-qubit system with at least thirteen projective measurements. The inspiring result for the first time theoretically confirms quantum nonlocality can be fundamentally asymmetric. Here, we propose another curious quantum phenomenon: Bell nonlocal states can be constructed from some steerable states. This novel finding not only offers a distinctive way to study Bell’s nonlocality without Bell’s inequality but with steering inequality, but also may avoid locality loophole in Bell’s tests and make Bell’s nonlocality easier for demonstration. Furthermore, a nine-setting steering inequality has also been presented for developing more efficient one-way steering and detecting some Bell nonlocal states